The parameters of minimal linear codes

Let k ? n be two positive integers and q a prime power. The basic question in minimal linear codes is to determine if there exists an [ , ] code. first objective of this paper present new sufficient necessary condition for minimal. Using condition, it easy construct or prove some are second use the partially give answer codes. third four classes codes, which generalize results about binary case given X. Li Q. Yue (2020) [13] . One can find that our method much easier more effective.